Exploring Boolean and Non-Boolean Computing Applications of Spin Torque Devices

نویسندگان

  • Kaushik Roy
  • Mrigank Sharad
  • Deliang Fan
  • Karthik Yogendra
چکیده

In this paper we discuss the potential of emerging spintorque devices for computing applications. Recent proposals for spinbased computing schemes may be differentiated as ‘all-spin’ vs. hybrid, programmable vs. fixed, and, Boolean vs. non-Boolean. Allspin logic-styles may offer high area-density due to small form-factor of nano-magnetic devices. However, circuit and system-level design techniques need to be explored that leaverage the specific spin-device characterisitcs to achieve energy-efficiency, performance and reliability comparable to those of CMOS. The non-volatility of nanomagnets can be exploited in the design of energy and area-efficient programmable logic. In such logic-styles, spin-devices may play the dual-role of computing as well as memory-elements that provide field-programmability. Spin-based threshold logic design is presented as an example (dynamic resisitve threshold logic and magnetic threshold logic). Emerging spintronic phenomena may lead to ultralow-voltage, current-mode, spin-torque switches that can offer attractive computing capabilities, beyond digital switches. Such devices may be suitable for non-Boolean data-processing applications which involve analog processing. Integration of such spin-torque devices with charge-based devices like CMOS and resistive memory can lead to highly energy-efficient information processing hardware for applicatons like pattern-matching, neuromorphic-computing, image-processing and data-conversion. Towards the end, we discuss the possibility of applying emerging spin-torque switches in the design of energy-efficient global interconnects, for future chip multiprocessors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beyond-CMOS Device Benchmarking for Boolean and Non-Boolean Logic Applications

The latest results of benchmarking research are presented for a variety of beyond-CMOS charge- and spin-based devices. In addition to improving the device-level models, several new device proposals and a few majorly modified devices are investigated. Deep pipelining circuits are employed to boost the throughput of low-power devices. Furthermore, the benchmarking methodology is extended to inter...

متن کامل

On some classes of expansions of ideals in $MV$-algebras

In this paper, we introduce the notions of expansion of ideals in $MV$-algebras, $ (tau,sigma)- $primary, $ (tau,sigma)$-obstinate  and $ (tau,sigma)$-Boolean  in $ MV- $algebras. We investigate the relations of them. For example, we show that every $ (tau,sigma)$-obstinate ideal of an $ MV-$ algebra is $ (tau,sigma)$-primary  and $ (tau,sigma)$-Boolean. In particular, we define an expansion $ ...

متن کامل

Approximation of non-Boolean functions by Boolean functions and applications in non-standard computing

Abstract We survey the research and we report new results related to the relationships that exist between Boolean and nonBoolean functions defined on Boolean algebras. The results included here are relevant for set-valued logic that is useful in several non-standard types of circuits: interconnectionfree biomolecular devices, devices based on optical wavelength multiplexing, etc. We extend our ...

متن کامل

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

Boolean Functions, Quantum Gates, Hamilton Operators, Spin Systems and Computer Algebra

We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. Computer algebra implementations are provided.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1308.2745  شماره 

صفحات  -

تاریخ انتشار 2013